Evolution of high-order connected components in random hypergraphs
نویسندگان
چکیده
منابع مشابه
Evolution of high-order connected components in random hypergraphs
We consider high-order connectivity in k-uniform hypergraphs defined as follows: Two j-sets are j-connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. We describe the evolution of jconnected components in the k-uniform binomial random hypergraph H(n, p). In particular, we determine the asymptotic size of the giant component shortly...
متن کاملConnected Components and Evolution of Random Graphs: An Algebraic Approach
Questions about a graph’s connected components are answered by studying appropriate powers of a special “adjacency matrix” constructed with entries in a commutative algebra whose generators are idempotent. The approach is then applied to the Erdös-Rényi model of sequences of random graphs. Developed herein is a method of encoding the relevant information from graph processes into a “second quan...
متن کاملConnected Components of 3-Partite 3-Uniform Hypergraphs
Social bookmarking sites allow users to organize resources like URLs, bibliographic references or media files using “tags”, arbitrary keywords that can be used later on to retrieve those resources. As many users (millions, on the most popular sites) perform such tagging in parallel, this leads to a rich, collaborative description of the tagged resources[2]. The resulting data can be interpreted...
متن کاملBirth and growth of multicyclic components in random hypergraphs
Define an `-component to be a connected b-uniform hypergraph with k edges and k(b − 1) − ` vertices. In this paper, we investigate the growth of size and complexity of connected components of a random hypergraph process. We prove that the expected number of creations of `-components during a random hypergraph process tends to 1 as b is fixed and ` tends to infinity with the total number of vert...
متن کاملThreshold and Hitting Time for High-Order Connectedness in Random Hypergraphs
We consider the following definition of connectedness in k-uniform hypergraphs: two j-sets (sets of j vertices) are j-connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. The hypergraph is jconnected if all j-sets are pairwise j-connected. We determine the threshold at which the random k-uniform hypergraph with edge probability p b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2015
ISSN: 1571-0653
DOI: 10.1016/j.endm.2015.06.077